Search for: All records

Channel estimation in rapidly time-varying or short and bursty communication scenarios is costly in terms of both pilot overhead and co-channel interference. In recent work, it was shown that multipath delay-diversity can be exploited to detect multiple co-channel user signals, provided that the relative multipath delays for the different users are distinct, and the two multipath ‘taps’ of each user have roughly commensurate power. These requirements may not hold naturally, however, especially for relatively narrowband or short-range transmissions with small delay spread. As an alternative, this paper advocates using dual antenna transmission in a manner that introduces artificial multipath and tight control of the power of the two channel taps, via baseband processing at the transmitter. The approach enjoys theoretical guarantees and affords simple decoding and accurate synchronization as a side bonus. Similar claims have been previously laid using packet repetition via a single transmit-antenna, but the dual-antenna artificial multipath scheme proposed herein doubles the transmission rate relative to packet repetition. Laboratory experiments using programmable radios are used to demonstrate successful operation of the proposed transmission scheme in practice. 

We introduce the triangle-densest-K-subgraph problem (TDKS) for undirected graphs: given a size parameter K, compute a subset of K vertices that maximizes the number of induced triangles. The problem corresponds to the simplest generalization of the edge based densest-K-subgraph problem (DKS) to the case of higher-order network motifs. We prove that TDKS is NP-hard and is not amenable to efficient approximation, in the worst-case. By judiciously exploiting the structure of the problem, we propose a relaxation algorithm for the purpose of obtaining high-quality, sub-optimal solutions. Our approach utilizes the fact that the cost function of TDKS is submodular to construct a convex relaxation for the problem based on the Lovász extension for submodular functions. We demonstrate that our approaches attain state-of-the-art performance on real-world graphs and can offer substantially improved exploration of the optimal density-size curve compared to sophisticated approximation baselines for DKS. We use document summarization to showcase why TDKS is a useful generalization of DKS. 

Node embedding is the task of extracting concise and informative representations of certain entities that are connected in a network. Various real-world networks include information about both node connectivity and certain node attributes, in the form of features or time-series data. Modern representation learning techniques employ both the connectivity and attribute information of the nodes to produce embeddings in an unsupervised manner. In this context, deriving embeddings that preserve the geometry of the network and the attribute vectors would be highly desirable, as they would reflect both the topological neighborhood structure and proximity in feature space. While this is fairly straightforward to maintain when only observing the connectivity or attribute information of the network, preserving the geometry of both types of information is challenging. A novel tensor factorization approach for node embedding in attributed networks is proposed in this paper, that preserves the distances of both the connections and the attributes. Furthermore, an effective and lightweight algorithm is developed to tackle the learning task and judicious experiments with multiple state-of-the-art baselines suggest that the proposed algorithm offers significant performance improvements in downstream tasks.